Discussion: Analysing identification issues in DSGE models by Nikolai Iskrev and Marco Ratto MONFISPOL workshop Tobias Cwik Goethe University Frankfurt

Source URL: www.monfispol.eu

• Econometrics
• Dynamic stochastic general equilibrium
• Macroeconomic model
• Monte Carlo method
• Parameter identification problem
• Economic model
• Parameter

LECTURE SLIDES ON DYNAMIC PROGRAMMING BASED ON LECTURES GIVEN AT THE MASSACHUSETTS INSTITUTE OF TECHNOLOGY CAMBRIDGE, MASS FALL 2004 DIMITRI P. BERTSEKAS

Source URL: athenasc.com

• Mathematical optimization
• Dynamic programming
• Equations
• Operations research
• Optimal control
• Bellman equation
• Algorithm
• Dimitri Bertsekas
• Shortest path problem
• Richard E. Bellman

Hans Kellerer, Ulrich Pferschy, David Pisinger Knapsack Problems Springer’s internal project number, if known Mathematics – Monograph (English)

Source URL: bioinfo.ict.ac.cn

• Operations research
• Dynamic programming
• Combinatorial optimization
• Packing problems
• Cryptography
• Knapsack problem
• Subset sum problem
• Approximation algorithm
• Algorithm
• Greedy algorithm
• Heuristic
• Branch and bound

Computer Science Education 2004, Vol. 14, No. 3, pp. 235–248 Teaching Algorithm Efficiency at CS1 Level: A Different Approach Judith Gal-Ezer, Tamar Vilner, and Ela Zur

Source URL: www.openu.ac.il

• Theoretical computer science
• Analysis of algorithms
• Dynamic programming
• Software optimization
• Algorithm
• Mathematical logic
• Selection algorithm
• Recursion
• Sort
• Best
• worst and average case
• Knapsack problem
• Matrix chain multiplication

dJay: Enabling High-density Multi-tenancy for Cloud Gaming Servers with Dynamic Cost-Benefit GPU Load Balancing Sergey Grizan, David Chu, Alec Wolman, Roger Wattenhofer Challenge Density Optimization Problem

Source URL: acmsocc.github.io

• Image processing
• Structural similarity

Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping Karl Bringmann∗ Marvin Künnemann†

Source URL: people.mpi-inf.mpg.de

• Dynamic programming
• Dynamic time warping
• Longest common subsequence problem
• Levenshtein distance
• Metric space
• Exponential time hypothesis
• NC

Adaptive Collective Routing Using Gaussian Process Dynamic Congestion Models Siyuan Liu, Yisong Yue, Ramayya Krishnan Carnegie Mellon University {siyuan,yisongyue,rk2x}@cmu.edu

Source URL: select.cs.cmu.edu

• Statistics
• Probability theory
• Algebra of random variables
• Covariance and correlation
• Routing
• Covariance
• Shortest path problem
• Mathematics
• Multivariate statistics
• Kalman filter

On the exhaustible-resource monopsony Matti Liski and Juan-Pablo Montero∗ July 13, 2011 Abstract The exhaustible-resource monopsony problem provides a basis for understanding the dynamic relationship between resource i

Source URL: hse-econ.fi

• Software
• Computing
• Computer programming
• Monopoly
• Cross-platform software
• Consumer theory
• Qt
• Price discrimination
• Economics
• Demand
• Monopsony

A PARTICLE SWARM OPTIMIZATION HYPER-HEURISTIC FOR THE DYNAMIC VEHICLE ROUTING PROBLEM Michal Okulewicz, Jacek Ma´ ndziuk Faculty of Mathematics and Information Science, Warsaw University of Technology,

Source URL: bioma.ijs.si

• Operations research
• Mathematical optimization
• Mathematics
• Applied mathematics
• Computational complexity theory
• NP-complete problems
• Cybernetics
• Evolutionary algorithms
• Ant colony optimization algorithms
• Particle swarm optimization
• Swarm intelligence
• Hyper-heuristic

Driving Results with Dynamic Creative Introduction In the world of digital advertising, reaching people is no longer the number one problem brands face when they plan

Source URL: www.sizmek.com